A parametric-space-based scan-line algorithm for rendering of bicubic surfaces

A novel scan-line algorithm for displaying bicubic surfaces is presented. Patches are decomposed on regions of constant sign of the z component of the normal before the scan process. Most of the computations are done in parametric space. The algorithm computes the intersection of the surfaces with only a restricted subset of scan planes and obtains the intersection with other scan planes by linear interpolation between exact intersections. A bound of the algorithm's error is given. The method is compared with Whitted's algorithm.Postprint (published version

Guia per a la implementació territorial de projectes de millora en l’atenció a la complexitat

Pacients crònics complexos; Atenció a la cronicitat avançada; Ruta assistencial de la complexitatPacientes crónicos complejos; Atención a la cronicidad avanzada; Ruta asistencial de la complejidadComplex chronic patients; Attention to advanced chronicity; Complexity care routeEls objectius d’aquesta guia són: definir les característiques, les estratègies d’identificació i el model genèric d’atenció de PCC i MACA i aportar una visió pragmàtica de la implementació d’iniciatives de base territorial per a l’atenció d’aquests pacients

TFG 2015/2016

Amb aquesta publicació, EINA, Centre universitari de Disseny i Art adscrit a la Universitat Autònoma de Barcelona, dóna a conèixer el recull dels Treballs de Fi de Grau presentats durant el curs 2015-2016. Voldríem que un recull com aquest donés una idea més precisa de la tasca que es realitza a EINA per tal de formar nous dissenyadors amb capacitat de respondre professionalment i intel·lectualment a les necessitats i exigències de la nostra societat. El treball formatiu s’orienta a oferir resultats que responguin tant a paràmetres de rigor acadèmic i capacitat d’anàlisi del context com a l’experimentació i la creació de nous llenguatges, tot fomentant el potencial innovador del disseny.Con esta publicación, EINA, Centro universitario de diseño y arte adscrito a la Universidad Autónoma de Barcelona, da a conocer la recopilación de los Trabajos de Fin de Grado presentados durante el curso 2015-2016. Querríamos que una recopilación como ésta diera una idea más precisa del trabajo que se realiza en EINA para formar nuevos diseñadores con capacidad de responder profesional e intelectualmente a las necesidades y exigencias de nuestra sociedad. El trabajo formativo se orienta a ofrecer resultados que respondan tanto a parámetros de rigor académico y capacidad de análisis, como a la experimentación y la creación de nuevos lenguajes, al tiempo que se fomenta el potencial innovador del diseño.With this publication, EINA, University School of Design and Art, affiliated to the Autonomous University of Barcelona, brings to the public eye the Final Degree Projects presented during the 2015-2016 academic year. Our hope is that this volume might offer a more precise idea of the task performed by EINA in training new designers, able to speak both professionally and intellectually to the needs and demands of our society. The educational task is oriented towards results that might respond to the parameters of academic rigour and the capacity for contextual analysis, as well as to considerations of experimentation and the creation of new languages, all the while reinforcing design’s innovative potential

The Use of visibility coherence for radiosity computation

Coherence has been widely used to improve the performance of visibility computation in traditional hidden line/surface algorithms. The appearance of radiosity algorithms has increased the importance of computing efficiently the visibility function given that it is performed a lot of times to obtain a single static image. We develop, in this paper, a characterization of the uses of coherence in radiosity algorithms and we give a brief and schematic description of proposed algorithms using them

The Use of visibility coherence for radiosity computation

Coherence has been widely used to improve the performance of visibility computation in traditional hidden line/surface algorithms. The appearance of radiosity algorithms has increased the importance of computing efficiently the visibility function given that it is performed a lot of times to obtain a single static image. We develop, in this paper, a characterization of the uses of coherence in radiosity algorithms and we give a brief and schematic description of proposed algorithms using them

Multilevel use of coherence for complex radiosity environments

The performance of radiosity algorithm has been improved in the last years by means of using coherence when evaluating the visibility function for form factor computation. We present here a characterization of the uses of coherence for this goal. The characterization includes both, previously proposed techniques and unexplored ones. Afterwards we propose new uses of coherence for visibility computation in form factor determination and we discuss the results of its implementation.Postprint (published version

Temporal coherence in progressive radiosity

In this paper we firstly present a study of the use of temporal coherence in radiosity algorithms. We underline the fact that this may be used even in static environments given that the behavior of a radiosity algorithm, when computing the form-factors of a surface, is the same as the behavior of an algorithm computing visibility for a sequence of view points corresponding to a linear movement. Secondly, we study the proposed solutions for dynamic environments. Finally, we propose an algorithm for dynamic environments which target is to reach a wide use of temporal coherence.Postprint (published version

A Global algorithm for linear radiosity

A linear algorithm for radiosity is presented, linear both in time and storage. The new algorithm is based on previous work by the authors and on the well known algorithms for progressive radiosity and Monte Carlo particle transport.Postprint (published version

A Global algorithm for linear radiosity

A linear algorithm for radiosity is presented, linear both in time and storage. The new algorithm is based on previous work by the authors and on the well known algorithms for progressive radiosity and Monte Carlo particle transport

Multilevel use of coherence for complex radiosity environments

The performance of radiosity algorithm has been improved in the last years by means of using coherence when evaluating the visibility function for form factor computation. We present here a characterization of the uses of coherence for this goal. The characterization includes both, previously proposed techniques and unexplored ones. Afterwards we propose new uses of coherence for visibility computation in form factor determination and we discuss the results of its implementation